Slide-The Key to Polynomial End-to-End Communication

*Preliminary versions of the various results in this paper appeared in Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, 1989, and Proc. of the Ele ̈enth w x Annual ACM Symp. on Principles of Distributed Computing, 1992 AMS89, AGR92 . Supported by Air Force Contract TNDGAFOSR-86-0078, ARO Contract DAAL03-86-K0171, NSF Contract CCR8611442, and a special grant from IBM. Supported by NSF Presidential Young Investigator Award under Grant DCR84-51396 and matching funds from XEROX Co. under Grant W881111. § Part of the research was done while the author was at Laboratory for Computer science, MIT, partially supported by NSF 865727-CCR, ARO DALL03-86-K-017, and ISEF fellowship, and at IBM]T. J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598. Part of this work was performed while this author was at the Hebrew University, Jerusalem and the TDS group at MIT. Supported by Israeli Communications Ministry Award, and by NSF Contract CCR-8611442, by ONR Contract N0014-85-K-0168, by DARPA Contract N00014-83-K-0125, and a special grant from IBM.